A Compact Formulation for the L21 Mixed-norm Minimization Problem
نویسندگان
چکیده
We present an equivalent, compact reformulation of the `2,1 mixednorm minimization problem for joint sparse signal reconstruction from multiple measurement vectors (MMVs). The reformulation builds upon a compact parameterization, which models the rownorms of the sparse signal representation as parameters of interest, resulting in a significant reduction of the MMV problem size. Given the sparse vector of row-norms, the joint sparse signal can be computed from the MMVs in closed form. For the special case of uniform linear sampling, we present an extension of the compact formulation for gridless parameter estimation by means of semidefinite programming. Furthermore, we derive in this case from our compact problem formulation the exact equivalence between the `2,1 mixednorm minimization and the atomic-norm minimization.
منابع مشابه
Non-Greedy L21-Norm Maximization for Principal Component Analysis
Principal Component Analysis (PCA) is one of the most important unsupervised methods to handle highdimensional data. However, due to the high computational complexity of its eigen decomposition solution, it hard to apply PCA to the large-scale data with high dimensionality. Meanwhile, the squared L2-norm based objective makes it sensitive to data outliers. In recent research, the L1-norm maximi...
متن کاملA Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants
In this article, we propose a special case of two-echelon location-routing problem (2E-LRP) in cash-in-transit (CIT) sector. To tackle this realistic problem and to make the model applicable, a rich LRP considering several existing real-life variants and characteristics named BO-2E-PCLRPSD-TW including different objective functions, multiple echelons, multiple periods, capacitated vehicles, dis...
متن کاملA Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...
متن کاملOptimizing over coherent risk measures and non-convexities: a robust mixed integer optimization approach
Recently, coherent risk measure minimization was formulated as robust optimization and the correspondence between coherent risk measures and uncertainty sets of robust optimization was investigated. We study minimizing coherent risk measures under a norm equality constraint with the use of robust optimization formulation. Not only existing coherent risk measures but also a new coherent risk mea...
متن کاملA Robust Adaptive Observer-Based Time Varying Fault Estimation
This paper presents a new observer design methodology for a time varying actuator fault estimation. A new linear matrix inequality (LMI) design algorithm is developed to tackle the limitations (e.g. equality constraint and robustness problems) of the well known so called fast adaptive fault estimation observer (FAFE). The FAFE is capable of estimating a wide range of time-varying actuator fault...
متن کامل